Distributed Computing and Cryptography with General Weak Random Sources

نویسندگان

  • Xin Li
  • Lorenzo Alvisi
  • Yael Kalai
  • Adam Klivans
  • David Zuckerman
چکیده

vi Chapter

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications

We study the problem of constructing multi-source extractors in the quantum setting, which extract almost uniform random bits against an adversary who collects quantum side information from several initially independent classical random sources. This is a natural generalization of the two much studied problems of seeded randomness extraction against quantum side information, and classical indep...

متن کامل

Deterministic Extractors - Lecture Notes

Randomness is used in many places in our daily lives. Some examples are gambling, statistics, algorithms, cryptography etc. For such applications one typically assumes a supply of completely unbiased and independent randim bits. This raises the problem of where to get these assumed random bits from. We could try and use natural sources of randomness such as sun spots, the stock market or the we...

متن کامل

Randomness Extraction Beyond the Classical World

Randomness is an extremely useful resource in diverse fields in computer science, such as randomized algorithms, distributed algorithms, and cryptography. In these fields, we often assume that perfect randomness are available. However, the assumption may not be realistic, since random sources available in our physical world tend to be correlated and biased. Furthermore, there is no way to ensur...

متن کامل

Cryptographic random and pseudorandom data generators

This dissertation thesis deals with cryptographic random and pseudorandom data generators in mobile computing environments (such as mobile phones, personal digital assistants, cryptographic smartcards). These mobile devices are typically bounded by the amount of energy, performance, memory or even silicon area. This lack of resources leads to very limited computing environments with: a) limited...

متن کامل

A Decentralized Online Sortition Protocol

We propose a new online sortition protocol which is decentralized. We argue that our protocol has safety, fairness, randomness, non-reputation and openness properties. Sortition is a process that makes random decision and it is used in competitions and lotteries to determine who is the winner. In the real world, sortition is simply done using a lottery machine and all the participa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011